Multi-Tenant C-RAN With Spectrum Pooling: Downlink Optimization Under Privacy Constraints
نویسندگان
چکیده
منابع مشابه
Multi-Tenant C-RAN With Spectrum Pooling: Downlink Optimization Under Privacy Constraints
Spectrum pooling allows multiple operators, or tenants, to share the same frequency bands. This work studies the optimization of spectrum pooling for the downlink of a multi-tenant Cloud Radio Access Network (C-RAN) system in the presence of inter-tenant privacy constraints. The spectrum available for downlink transmission is partitioned into private and shared subbands, and the participating o...
متن کاملDownlink SINR Balancing in C-RAN under Limited Fronthaul Capacity
Cloud radio access network (C-RAN) with centralized baseband processing is envisioned as a promising candidate for the next-generation wireless communication network. However, the joint processing gain of C-RAN is fundamentally constrained by the finite-capacity fronthaul links between the central unit (CU) where joint processing is implemented and distributed access points known as remote radi...
متن کاملReliability optimization problems with multiple constraints under fuzziness
In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...
متن کاملEstimation Efficiency Under Privacy Constraints
We investigate the problem of estimating a random variable Y ∈ Y under a privacy constraint dictated by another correlated random variable X ∈ X , where estimation efficiency and privacy are assessed in terms of two different loss functions. In the discrete case, we use the Hamming loss function and express the corresponding utility-privacy tradeoff in terms of the privacy-constrained guessing ...
متن کاملInformation Extraction Under Privacy Constraints
A privacy-constrained information extraction problem is considered where for a pair of correlated discrete random variables (X,Y ) governed by a given joint distribution, an agent observes Y and wants to convey to a potentially public user as much information about Y as possible without compromising the amount of information revealed about X . To this end, the so-called rate-privacy function is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2018
ISSN: 0018-9545,1939-9359
DOI: 10.1109/tvt.2018.2865599